A greedy Delaunay-based surface reconstruction algorithm
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Delaunay Based Surface Reconstruction
Advanced 3D scanning technologies enable us to obtain dense and accurate surface sample point sets. From sufficiently dense sample point set, Crust algorithm, which is based on Voronoi diagram and its dual Delaunay triangulation, can reconstruct a triangle mesh that is topologically valid and convergent to the original surface. However, the algorithm is restricted in the practical application b...
متن کاملSurface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on...
متن کاملDelaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms
Given a finite sampling P ⊂ R of an unknown surface S, surface reconstruction is concerned with the calculation of a model of S from P . The model can be represented as a smooth or a triangulated surface, and is expected to match S from a topological and geometric standpoints. In this survey, we focus on the recent developments of Delaunay based surface reconstruction methods, which were the fi...
متن کاملVariational surface reconstruction based on Delaunay triangulation and graph cut
A novel method for surface reconstruction from an unorganized point set is presented. An energy functional based on a weighted minimal surface model is proposed for surface reconstruction, which is efficiently minimized by graph cut methods. By solving the minimization problem on the graph dual to a Delaunaybased tetrahedral mesh, the advantages of explicit and implicit methods for surface reco...
متن کاملA greedy algorithm for yield surface approximation
This Note presents an approximation method for convex yield surfaces in the framework of yield design theory. The proposed algorithm constructs an approximation using a convex hull of ellipsoids such that the approximate criterion can be formulated in terms of second-order conic constraints. The algorithm can treat bounded as well as unbounded yield surfaces. Its efficiency is illustrated on tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 2004
ISSN: 0178-2789,1432-8726
DOI: 10.1007/s00371-003-0217-z